Method and apparatus for video coding

ABSTRACT

Aspects of the disclosure provide methods and apparatuses for video encoding/decoding. In some examples, an apparatus for video decoding includes receiving circuitry and processing circuitry. The processing circuitry receives first data of picture segments of a first picture in a video sequence. The picture segments of the first picture include a first segment of the first picture that is intra coded, and at least a second segment of the first picture. The second segment can be intra coded or inter coded. Further, the processing circuitry receives second data of the first segment of the first picture that is intra coded. The second data corresponds to a re-transmission of a subset of the picture segments. The processing circuitry reconstructs samples of the first segment of the first picture based on the second data when a decoding of the first segment of the first picture based on the first data fails.

TECHNICAL FIELD

The present disclosure describes embodiments generally related to video coding.

BACKGROUND

The background description provided herein is for the purpose of generally presenting the context of the disclosure. Work of the presently named inventors, to the extent the work is described in this background section, as well as aspects of the description that may not otherwise qualify as prior art at the time of filing, are neither expressly nor impliedly admitted as prior art against the present disclosure.

Video coding and decoding can be performed using inter-picture prediction with motion compensation. Uncompressed digital video can include a series of pictures, each picture having a spatial dimension of, for example, 1920×1080 luminance samples and associated chrominance samples. The series of pictures can have a fixed or variable picture rate (informally also known as frame rate), of, for example 60 pictures per second or 60 Hz. Uncompressed video has significant bitrate requirements. For example, 1080p60 4:2:0 video at 8 bit per sample (1920×1080 luminance sample resolution at 60 Hz frame rate) requires close to 1.5 Gbit/s bandwidth. An hour of such video requires more than 600 GBytes of storage space.

One purpose of video coding and decoding can be the reduction of redundancy in the input video signal, through compression. Compression can help reduce the aforementioned bandwidth or storage space requirements, in some cases by two orders of magnitude or more. Both lossless and lossy compression, as well as a combination thereof can be employed. Lossless compression refers to techniques where an exact copy of the original signal can be reconstructed from the compressed original signal. When using lossy compression, the reconstructed signal may not be identical to the original signal, but the distortion between original and reconstructed signals is small enough to make the reconstructed signal useful for the intended application. In the case of video, lossy compression is widely employed. The amount of distortion tolerated depends on the application; for example, users of certain consumer streaming applications may tolerate higher distortion than users of television distribution applications. The compression ratio achievable can reflect that: higher allowable/tolerable distortion can yield higher compression ratios.

A video encoder and decoder can utilize techniques from several broad categories, including, for example, motion compensation, transform, quantization, and entropy coding.

Video codec technologies can include techniques known as intra coding. In intra coding, sample values are represented without reference to samples or other data from previously reconstructed reference pictures. In some video codecs, the picture is spatially subdivided into blocks of samples. When all blocks of samples are coded in intra mode, that picture can be an intra picture. Intra pictures and their derivations such as independent decoder refresh pictures, can be used to reset the decoder state and can, therefore, be used as the first picture in a coded video bitstream and a video session, or as a still image. The samples of an intra block can be exposed to a transform, and the transform coefficients can be quantized before entropy coding. Intra prediction can be a technique that minimizes sample values in the pre-transform domain. In some cases, the smaller the DC value after a transform is, and the smaller the AC coefficients are, the fewer the bits that are required at a given quantization step size to represent the block after entropy coding.

Traditional intra coding such as known from, for example MPEG-2 generation coding technologies, does not use intra prediction. However, some newer video compression technologies include techniques that attempt, from, for example, surrounding sample data and/or metadata obtained during the encoding/decoding of spatially neighboring, and preceding in decoding order, blocks of data. Such techniques are henceforth called “intra prediction” techniques. Note that in at least some cases, intra prediction is only using reference data from the current picture under reconstruction and not from reference pictures.

There can be many different forms of intra prediction. When more than one of such techniques can be used in a given video coding technology, the technique in use can be coded in an intra prediction mode. In certain cases, modes can have submodes and/or parameters, and those can be coded individually or included in the mode codeword. Which codeword to use for a given mode/submode/parameter combination can have an impact in the coding efficiency gain through intra prediction, and so can the entropy coding technology used to translate the codewords into a bitstream.

A certain mode of intra prediction was introduced with H.264, refined in H.265, and further refined in newer coding technologies such as joint exploration model (JEM), versatile video coding (VVC), and benchmark set (BMS). A predictor block can be formed using neighboring sample values belonging to already available samples. Sample values of neighboring samples are copied into the predictor block according to a direction. A reference to the direction in use can be coded in the bitstream or may itself be predicted.

Referring to FIG. 1, depicted in the lower right is a subset of nine predictor directions known from H.265's 33 possible predictor directions (corresponding to the 33 angular modes of the 35 intra modes). The point where the arrows converge (101) represents the sample being predicted. The arrows represent the direction from which the sample is being predicted. For example, arrow (102) indicates that sample (101) is predicted from a sample or samples to the upper right, at a 45 degree angle from the horizontal. Similarly, arrow (103) indicates that sample (101) is predicted from a sample or samples to the lower left of sample (101), in a 22.5 degree angle from the horizontal.

Still referring to FIG. 1, on the top left there is depicted a square block (104) of 4×4 samples (indicated by a dashed, boldface line). The square block (104) includes 16 samples, each labelled with an “S”, its position in the Y dimension (e.g., row index) and its position in the X dimension (e.g., column index). For example, sample S21 is the second sample in the Y dimension (from the top) and the first (from the left) sample in the X dimension. Similarly, sample S44 is the fourth sample in block (104) in both the Y and X dimensions. As the block is 4×4 samples in size, S44 is at the bottom right. Further shown are reference samples that follow a similar numbering scheme. A reference sample is labelled with an R, its Y position (e.g., row index) and X position (column index) relative to block (104). In both H.264 and H.265, prediction samples neighbor the block under reconstruction; therefore no negative values need to be used.

Intra picture prediction can work by copying reference sample values from the neighboring samples as appropriated by the signaled prediction direction. For example, assume the coded video bitstream includes signaling that, for this block, indicates a prediction direction consistent with arrow (102)—that is, samples are predicted from a prediction sample or samples to the upper right, at a 45 degree angle from the horizontal. In that case, samples S41, S32, S23, and S14 are predicted from the same reference sample R05. Sample S44 is then predicted from reference sample R08.

In certain cases, the values of multiple reference samples may be combined, for example through interpolation, in order to calculate a reference sample; especially when the directions are not evenly divisible by 45 degrees.

The number of possible directions has increased as video coding technology has developed. In H.264 (year 2003), nine different direction could be represented. That increased to 33 in H.265 (year 2013), and JEM/VVC/BMS, at the time of disclosure, can support up to 65 directions. Experiments have been conducted to identify the most likely directions, and certain techniques in the entropy coding are used to represent those likely directions in a small number of bits, accepting a certain penalty for less likely directions. Further, the directions themselves can sometimes be predicted from neighboring directions used in neighboring, already decoded, blocks.

FIG. 2 shows a schematic (201) that depicts 65 intra prediction directions according to JEM to illustrate the increasing number of prediction directions over time.

The mapping of intra prediction directions bits in the coded video bitstream that represent the direction can be different from video coding technology to video coding technology; and can range, for example, from simple direct mappings of prediction direction to intra prediction mode, to codewords, to complex adaptive schemes involving most probable modes, and similar techniques. In all cases, however, there can be certain directions that are statistically less likely to occur in video content than certain other directions. As the goal of video compression is the reduction of redundancy, those less likely directions will, in a well working video coding technology, be represented by a larger number of bits than more likely directions.

SUMMARY

Aspects of the disclosure provide methods and apparatuses for video encoding/decoding. In some examples, an apparatus for video decoding includes receiving circuitry and processing circuitry. For example, the processing circuitry receives first data of picture segments of a first picture in a video sequence. The picture segments of the first picture include a first segment of the first picture that is intra coded, and at least a second segment of the first picture. The second segment can be inter coded or intra coded. Further, the processing circuitry receives second data of the first segment of the first picture that is intra coded. The second data corresponds to a re-transmission of a subset of the picture segments. The processing circuitry reconstructs samples of the first segment of the first picture based on the second data when a decoding of the first segment of the first picture based on the first data fails.

In an embodiment, the first segment of the first picture is a center segment of the first picture. In another embodiment, the first segment of the first picture overlaps with a region of interest (ROI).

According to an aspect of the disclosure, the region of interest is predefined. In an example, the processing circuitry receives, in a header for the first segment of the first picture, an indicator that indicates the first segment of the first picture being the region of interest. In another example, the processing circuitry receives, in a supplemental enhancement information (SEI) message that is transmitted separately from the video sequence, an indicator that indicates the first segment being the region of interest.

In some embodiments, the first picture is one of multiple key pictures that each includes an intra coded segment, and the intra coded segments of the multiple key pictures are complementary. In some examples, the processing circuitry receives prediction information of a block in a second picture that is coded after the first picture. The block is located within a segment that is collocated with the first segment. Then, the processing circuitry reconstructs the block with direct reference or indirect reference to the intra coded segments of the multiple key pictures. In an example, the multiple key pictures are consecutive pictures.

Aspects of the disclosure also provide a non-transitory computer-readable medium storing instructions which when executed by a computer for video decoding cause the computer to perform the method for video decoding.

BRIEF DESCRIPTION OF THE DRAWINGS

Further features, the nature, and various advantages of the disclosed subject matter will be more apparent from the following detailed description and the accompanying drawings in which:

FIG. 1 is a schematic illustration of an exemplary subset of intra prediction modes.

FIG. 2 is an illustration of exemplary intra prediction directions.

FIG. 3 is a schematic illustration of a simplified block diagram of a communication system (300) in accordance with an embodiment.

FIG. 4 is a schematic illustration of a simplified block diagram of a communication system (400) in accordance with an embodiment.

FIG. 5 is a schematic illustration of a simplified block diagram of a decoder in accordance with an embodiment.

FIG. 6 is a schematic illustration of a simplified block diagram of an encoder in accordance with an embodiment.

FIG. 7 shows a block diagram of an encoder in accordance with another embodiment.

FIG. 8 shows a block diagram of a decoder in accordance with another embodiment.

FIGS. 9A and 9B show segmentation examples according to some embodiments of the disclosure;

FIGS. 10A-10C show segmentation examples for a key picture according to some embodiments of the disclosure.

FIG. 11 shows an example of a video sequence according to an embodiment of the disclosure.

FIG. 12 shows an example of a video sequence according to an embodiment of the disclosure.

FIG. 13 shows an example for an error protection point (or boundary) according to an embodiment of the disclosure.

FIG. 14 shows a flow chart outlining a process example according to an embodiment of the disclosure.

FIG. 15 is a schematic illustration of a computer system in accordance with an embodiment.

DETAILED DESCRIPTION OF EMBODIMENTS

FIG. 3 illustrates a simplified block diagram of a communication system (300) according to an embodiment of the present disclosure. The communication system (300) includes a plurality of terminal devices that can communicate with each other, via, for example, a network (350). For example, the communication system (300) includes a first pair of terminal devices (310) and (320) interconnected via the network (350). In the FIG. 3 example, the first pair of terminal devices (310) and (320) performs unidirectional transmission of data. For example, the terminal device (310) may code video data (e.g., a stream of video pictures that are captured by the terminal device (310)) for transmission to the other terminal device (320) via the network (350). The encoded video data can be transmitted in the form of one or more coded video bitstreams. The terminal device (320) may receive the coded video data from the network (350), decode the coded video data to recover the video pictures and display video pictures according to the recovered video data. Unidirectional data transmission may be common in media serving applications and the like.

In another example, the communication system (300) includes a second pair of terminal devices (330) and (340) that performs bidirectional transmission of coded video data that may occur, for example, during videoconferencing. For bidirectional transmission of data, in an example, each terminal device of the terminal devices (330) and (340) may code video data (e.g., a stream of video pictures that are captured by the terminal device) for transmission to the other terminal device of the terminal devices (330) and (340) via the network (350). Each terminal device of the terminal devices (330) and (340) also may receive the coded video data transmitted by the other terminal device of the terminal devices (330) and (340), and may decode the coded video data to recover the video pictures and may display video pictures at an accessible display device according to the recovered video data.

In the FIG. 3 example, the terminal devices (310), (320), (330) and (340) may be illustrated as servers, personal computers and smart phones but the principles of the present disclosure may be not so limited. Embodiments of the present disclosure find application with laptop computers, tablet computers, media players and/or dedicated video conferencing equipment. The network (350) represents any number of networks that convey coded video data among the terminal devices (310), (320), (330) and (340), including for example wireline (wired) and/or wireless communication networks. The communication network (350) may exchange data in circuit-switched and/or packet-switched channels. Representative networks include telecommunications networks, local area networks, wide area networks and/or the Internet. For the purposes of the present discussion, the architecture and topology of the network (350) may be immaterial to the operation of the present disclosure unless explained herein below.

FIG. 4 illustrates, as an example for an application for the disclosed subject matter, the placement of a video encoder and a video decoder in a streaming environment. The disclosed subject matter can be equally applicable to other video enabled applications, including, for example, video conferencing, digital TV, storing of compressed video on digital media including CD, DVD, memory stick and the like, and so on.

A streaming system may include a capture subsystem (413), that can include a video source (401), for example a digital camera, creating for example a stream of video pictures (402) that are uncompressed. In an example, the stream of video pictures (402) includes samples that are taken by the digital camera. The stream of video pictures (402), depicted as a bold line to emphasize a high data volume when compared to encoded video data (404) (or coded video bitstreams), can be processed by an electronic device (420) that includes a video encoder (403) coupled to the video source (401). The video encoder (403) can include hardware, software, or a combination thereof to enable or implement aspects of the disclosed subject matter as described in more detail below. The encoded video data (404) (or encoded video bitstream (404)), depicted as a thin line to emphasize the lower data volume when compared to the stream of video pictures (402), can be stored on a streaming server (405) for future use. One or more streaming client subsystems, such as client subsystems (406) and (408) in FIG. 4 can access the streaming server (405) to retrieve copies (407) and (409) of the encoded video data (404). A client subsystem (406) can include a video decoder (410), for example, in an electronic device (430). The video decoder (410) decodes the incoming copy (407) of the encoded video data and creates an outgoing stream of video pictures (411) that can be rendered on a display (412) (e.g., display screen) or other rendering device (not depicted). In some streaming systems, the encoded video data (404), (407), and (409) (e.g., video bitstreams) can be encoded according to certain video coding/compression standards. Examples of those standards include ITU-T Recommendation H.265. In an example, a video coding standard under development is informally known as Versatile Video Coding (VVC). The disclosed subject matter may be used in the context of VVC.

It is noted that the electronic devices (420) and (430) can include other components (not shown). For example, the electronic device (420) can include a video decoder (not shown) and the electronic device (430) can include a video encoder (not shown) as well.

FIG. 5 shows a block diagram of a video decoder (510) according to an embodiment of the present disclosure. The video decoder (510) can be included in an electronic device (530). The electronic device (530) can include a receiver (531) (e.g., receiving circuitry). The video decoder (510) can be used in the place of the video decoder (410) in the FIG. 4 example.

The receiver (531) may receive one or more coded video sequences to be decoded by the video decoder (510); in the same or another embodiment, one coded video sequence at a time, where the decoding of each coded video sequence is independent from other coded video sequences. The coded video sequence may be received from a channel (501), which may be a hardware/software link to a storage device which stores the encoded video data. The receiver (531) may receive the encoded video data with other data, for example, coded audio data and/or ancillary data streams, that may be forwarded to their respective using entities (not depicted). The receiver (531) may separate the coded video sequence from the other data. To combat network jitter, a buffer memory (515) may be coupled in between the receiver (531) and an entropy decoder/parser (520) (“parser (520)” henceforth). In certain applications, the buffer memory (515) is part of the video decoder (510). In others, it can be outside of the video decoder (510) (not depicted). In still others, there can be a buffer memory (not depicted) outside of the video decoder (510), for example to combat network jitter, and in addition another buffer memory (515) inside the video decoder (510), for example to handle playout timing. When the receiver (531) is receiving data from a store/forward device of sufficient bandwidth and controllability, or from an isosynchronous network, the buffer memory (515) may not be needed, or can be small. For use on best effort packet networks such as the Internet, the buffer memory (515) may be required, can be comparatively large and can be advantageously of adaptive size, and may at least partially be implemented in an operating system or similar elements (not depicted) outside of the video decoder (510).

The video decoder (510) may include the parser (520) to reconstruct symbols (521) from the coded video sequence. Categories of those symbols include information used to manage operation of the video decoder (510), and potentially information to control a rendering device such as a render device (512) (e.g., a display screen) that is not an integral part of the electronic device (530) but can be coupled to the electronic device (530), as was shown in FIG. 5. The control information for the rendering device(s) may be in the form of Supplemental Enhancement Information (SEI messages) or Video Usability Information (VUI) parameter set fragments (not depicted). The parser (520) may parse/entropy-decode the coded video sequence that is received. The coding of the coded video sequence can be in accordance with a video coding technology or standard, and can follow various principles, including variable length coding, Huffman coding, arithmetic coding with or without context sensitivity, and so forth. The parser (520) may extract from the coded video sequence, a set of subgroup parameters for at least one of the subgroups of pixels in the video decoder, based upon at least one parameter corresponding to the group. Subgroups can include Groups of Pictures (GOPs), pictures, tiles, slices, macroblocks, Coding Units (CUs), blocks, Transform Units (TUs), Prediction Units (PUs) and so forth. The parser (520) may also extract from the coded video sequence information such as transform coefficients, quantizer parameter values, motion vectors, and so forth.

The parser (520) may perform an entropy decoding/parsing operation on the video sequence received from the buffer memory (515), so as to create symbols (521).

Reconstruction of the symbols (521) can involve multiple different units depending on the type of the coded video picture or parts thereof (such as: inter and intra picture, inter and intra block), and other factors. Which units are involved, and how, can be controlled by the subgroup control information that was parsed from the coded video sequence by the parser (520). The flow of such subgroup control information between the parser (520) and the multiple units below is not depicted for clarity.

Beyond the functional blocks already mentioned, the video decoder (510) can be conceptually subdivided into a number of functional units as described below. In a practical implementation operating under commercial constraints, many of these units interact closely with each other and can, at least partly, be integrated into each other. However, for the purpose of describing the disclosed subject matter, the conceptual subdivision into the functional units below is appropriate.

A first unit is the scaler/inverse transform unit (551). The scaler/inverse transform unit (551) receives a quantized transform coefficient as well as control information, including which transform to use, block size, quantization factor, quantization scaling matrices, etc. as symbol(s) (521) from the parser (520). The scaler/inverse transform unit (551) can output blocks comprising sample values, that can be input into aggregator (555).

In some cases, the output samples of the scaler/inverse transform (551) can pertain to an intra coded block; that is: a block that is not using predictive information from previously reconstructed pictures, but can use predictive information from previously reconstructed parts of the current picture. Such predictive information can be provided by an intra picture prediction unit (552). In some cases, the intra picture prediction unit (552) generates a block of the same size and shape of the block under reconstruction, using surrounding already reconstructed information fetched from the current picture buffer (558). The current picture buffer (558) buffers, for example, partly reconstructed current picture and/or fully reconstructed current picture. The aggregator (555), in some cases, adds, on a per sample basis, the prediction information the intra prediction unit (552) has generated to the output sample information as provided by the scaler/inverse transform unit (551).

In other cases, the output samples of the scaler/inverse transform unit (551) can pertain to an inter coded, and potentially motion compensated block. In such a case, a motion compensation prediction unit (553) can access reference picture memory (557) to fetch samples used for prediction. After motion compensating the fetched samples in accordance with the symbols (521) pertaining to the block, these samples can be added by the aggregator (555) to the output of the scaler/inverse transform unit (551) (in this case called the residual samples or residual signal) so as to generate output sample information. The addresses within the reference picture memory (557) from where the motion compensation prediction unit (553) fetches prediction samples can be controlled by motion vectors, available to the motion compensation prediction unit (553) in the form of symbols (521) that can have, for example X, Y, and reference picture components. Motion compensation also can include interpolation of sample values as fetched from the reference picture memory (557) when sub-sample exact motion vectors are in use, motion vector prediction mechanisms, and so forth.

The output samples of the aggregator (555) can be subject to various loop filtering techniques in the loop filter unit (556). Video compression technologies can include in-loop filter technologies that are controlled by parameters included in the coded video sequence (also referred to as coded video bitstream) and made available to the loop filter unit (556) as symbols (521) from the parser (520), but can also be responsive to meta-information obtained during the decoding of previous (in decoding order) parts of the coded picture or coded video sequence, as well as responsive to previously reconstructed and loop-filtered sample values.

The output of the loop filter unit (556) can be a sample stream that can be output to the render device (512) as well as stored in the reference picture memory (557) for use in future inter-picture prediction.

Certain coded pictures, once fully reconstructed, can be used as reference pictures for future prediction. For example, once a coded picture corresponding to a current picture is fully reconstructed and the coded picture has been identified as a reference picture (by, for example, the parser (520)), the current picture buffer (558) can become a part of the reference picture memory (557), and a fresh current picture buffer can be reallocated before commencing the reconstruction of the following coded picture.

The video decoder (510) may perform decoding operations according to a predetermined video compression technology in a standard, such as ITU-T Rec. H.265. The coded video sequence may conform to a syntax specified by the video compression technology or standard being used, in the sense that the coded video sequence adheres to both the syntax of the video compression technology or standard and the profiles as documented in the video compression technology or standard. Specifically, a profile can select certain tools as the only tools available for use under that profile from all the tools available in the video compression technology or standard. Also necessary for compliance can be that the complexity of the coded video sequence is within bounds as defined by the level of the video compression technology or standard. In some cases, levels restrict the maximum picture size, maximum frame rate, maximum reconstruction sample rate (measured in, for example megasamples per second), maximum reference picture size, and so on. Limits set by levels can, in some cases, be further restricted through Hypothetical Reference Decoder (HRD) specifications and metadata for HRD buffer management signaled in the coded video sequence.

In an embodiment, the receiver (531) may receive additional (redundant) data with the encoded video. The additional data may be included as part of the coded video sequence(s). The additional data may be used by the video decoder (510) to properly decode the data and/or to more accurately reconstruct the original video data. Additional data can be in the form of, for example, temporal, spatial, or signal noise ratio (SNR) enhancement layers, redundant slices, redundant pictures, forward error correction codes, and so on.

FIG. 6 shows a block diagram of a video encoder (603) according to an embodiment of the present disclosure. The video encoder (603) is included in an electronic device (620). The electronic device (620) includes a transmitter (640) (e.g., transmitting circuitry). The video encoder (603) can be used in the place of the video encoder (403) in the FIG. 4 example.

The video encoder (603) may receive video samples from a video source (601) (that is not part of the electronic device (620) in the FIG. 6 example) that may capture video image(s) to be coded by the video encoder (603). In another example, the video source (601) is a part of the electronic device (620).

The video source (601) may provide the source video sequence to be coded by the video encoder (603) in the form of a digital video sample stream that can be of any suitable bit depth (for example: 8 bit, 10 bit, 12 bit, . . . ), any colorspace (for example, BT.601 Y CrCB, RGB, . . . ), and any suitable sampling structure (for example Y CrCb 4:2:0, Y CrCb 4:4:4). In a media serving system, the video source (601) may be a storage device storing previously prepared video. In a videoconferencing system, the video source (601) may be a camera that captures local image information as a video sequence. Video data may be provided as a plurality of individual pictures that impart motion when viewed in sequence. The pictures themselves may be organized as a spatial array of pixels, wherein each pixel can comprise one or more samples depending on the sampling structure, color space, etc. in use. A person skilled in the art can readily understand the relationship between pixels and samples. The description below focuses on samples.

According to an embodiment, the video encoder (603) may code and compress the pictures of the source video sequence into a coded video sequence (643) in real time or under any other time constraints as required by the application. Enforcing appropriate coding speed is one function of a controller (650). In some embodiments, the controller (650) controls other functional units as described below and is functionally coupled to the other functional units. The coupling is not depicted for clarity. Parameters set by the controller (650) can include rate control related parameters (picture skip, quantizer, lambda value of rate-distortion optimization techniques, . . . ), picture size, group of pictures (GOP) layout, maximum motion vector search range, and so forth. The controller (650) can be configured to have other suitable functions that pertain to the video encoder (603) optimized for a certain system design.

In some embodiments, the video encoder (603) is configured to operate in a coding loop. As an oversimplified description, in an example, the coding loop can include a source coder (630) (e.g., responsible for creating symbols, such as a symbol stream, based on an input picture to be coded, and a reference picture(s)), and a (local) decoder (633) embedded in the video encoder (603). The decoder (633) reconstructs the symbols to create the sample data in a similar manner as a (remote) decoder also would create (as any compression between symbols and coded video bitstream is lossless in the video compression technologies considered in the disclosed subject matter). The reconstructed sample stream (sample data) is input to the reference picture memory (634). As the decoding of a symbol stream leads to bit-exact results independent of decoder location (local or remote), the content in the reference picture memory (634) is also bit exact between the local encoder and remote encoder. In other words, the prediction part of an encoder “sees” as reference picture samples exactly the same sample values as a decoder would “see” when using prediction during decoding. This fundamental principle of reference picture synchronicity (and resulting drift, if synchronicity cannot be maintained, for example because of channel errors) is used in some related arts as well.

The operation of the “local” decoder (633) can be the same as of a “remote” decoder, such as the video decoder (510), which has already been described in detail above in conjunction with FIG. 5. Briefly referring also to FIG. 5, however, as symbols are available and encoding/decoding of symbols to a coded video sequence by an entropy coder (645) and the parser (520) can be lossless, the entropy decoding parts of the video decoder (510), including the buffer memory (515), and parser (520) may not be fully implemented in the local decoder (633).

An observation that can be made at this point is that any decoder technology except the parsing/entropy decoding that is present in a decoder also necessarily needs to be present, in substantially identical functional form, in a corresponding encoder. For this reason, the disclosed subject matter focuses on decoder operation. The description of encoder technologies can be abbreviated as they are the inverse of the comprehensively described decoder technologies. Only in certain areas a more detail description is required and provided below.

During operation, in some examples, the source coder (630) may perform motion compensated predictive coding, which codes an input picture predictively with reference to one or more previously-coded picture from the video sequence that were designated as “reference pictures”. In this manner, the coding engine (632) codes differences between pixel blocks of an input picture and pixel blocks of reference picture(s) that may be selected as prediction reference(s) to the input picture.

The local video decoder (633) may decode coded video data of pictures that may be designated as reference pictures, based on symbols created by the source coder (630). Operations of the coding engine (632) may advantageously be lossy processes. When the coded video data may be decoded at a video decoder (not shown in FIG. 6), the reconstructed video sequence typically may be a replica of the source video sequence with some errors. The local video decoder (633) replicates decoding processes that may be performed by the video decoder on reference pictures and may cause reconstructed reference pictures to be stored in the reference picture cache (634). In this manner, the video encoder (603) may store copies of reconstructed reference pictures locally that have common content as the reconstructed reference pictures that will be obtained by a far-end video decoder (absent transmission errors).

The predictor (635) may perform prediction searches for the coding engine (632). That is, for a new picture to be coded, the predictor (635) may search the reference picture memory (634) for sample data (as candidate reference pixel blocks) or certain metadata such as reference picture motion vectors, block shapes, and so on, that may serve as an appropriate prediction reference for the new pictures. The predictor (635) may operate on a sample block-by-pixel block basis to find appropriate prediction references. In some cases, as determined by search results obtained by the predictor (635), an input picture may have prediction references drawn from multiple reference pictures stored in the reference picture memory (634).

The controller (650) may manage coding operations of the source coder (630), including, for example, setting of parameters and subgroup parameters used for encoding the video data.

Output of all aforementioned functional units may be subjected to entropy coding in the entropy coder (645). The entropy coder (645) translates the symbols as generated by the various functional units into a coded video sequence, by lossless compressing the symbols according to technologies such as Huffman coding, variable length coding, arithmetic coding, and so forth.

The transmitter (640) may buffer the coded video sequence(s) as created by the entropy coder (645) to prepare for transmission via a communication channel (660), which may be a hardware/software link to a storage device which would store the encoded video data. The transmitter (640) may merge coded video data from the video coder (603) with other data to be transmitted, for example, coded audio data and/or ancillary data streams (sources not shown).

The controller (650) may manage operation of the video encoder (603). During coding, the controller (650) may assign to each coded picture a certain coded picture type, which may affect the coding techniques that may be applied to the respective picture. For example, pictures often may be assigned as one of the following picture types:

An Intra Picture (I picture) may be one that may be coded and decoded without using any other picture in the sequence as a source of prediction. Some video codecs allow for different types of intra pictures, including, for example Independent Decoder Refresh (“IDR”) Pictures. A person skilled in the art is aware of those variants of I pictures and their respective applications and features.

A predictive picture (P picture) may be one that may be coded and decoded using intra prediction or inter prediction using at most one motion vector and reference index to predict the sample values of each block.

A bi-directionally predictive picture (B Picture) may be one that may be coded and decoded using intra prediction or inter prediction using at most two motion vectors and reference indices to predict the sample values of each block. Similarly, multiple-predictive pictures can use more than two reference pictures and associated metadata for the reconstruction of a single block.

Source pictures commonly may be subdivided spatially into a plurality of sample blocks (for example, blocks of 4×4, 8×8, 4×8, or 16×16 samples each) and coded on a block-by-block basis. Blocks may be coded predictively with reference to other (already coded) blocks as determined by the coding assignment applied to the blocks' respective pictures. For example, blocks of I pictures may be coded non-predictively or they may be coded predictively with reference to already coded blocks of the same picture (spatial prediction or intra prediction). Pixel blocks of P pictures may be coded predictively, via spatial prediction or via temporal prediction with reference to one previously coded reference picture. Blocks of B pictures may be coded predictively, via spatial prediction or via temporal prediction with reference to one or two previously coded reference pictures.

The video encoder (603) may perform coding operations according to a predetermined video coding technology or standard, such as ITU-T Rec. H.265. In its operation, the video encoder (603) may perform various compression operations, including predictive coding operations that exploit temporal and spatial redundancies in the input video sequence. The coded video data, therefore, may conform to a syntax specified by the video coding technology or standard being used.

In an embodiment, the transmitter (640) may transmit additional data with the encoded video. The source coder (630) may include such data as part of the coded video sequence. Additional data may comprise temporal/spatial/SNR enhancement layers, other forms of redundant data such as redundant pictures and slices, SEI messages, VUI parameter set fragments, and so on.

A video may be captured as a plurality of source pictures (video pictures) in a temporal sequence. Intra-picture prediction (often abbreviated to intra prediction) makes use of spatial correlation in a given picture, and inter-picture prediction makes uses of the (temporal or other) correlation between the pictures. In an example, a specific picture under encoding/decoding, which is referred to as a current picture, is partitioned into blocks. When a block in the current picture is similar to a reference block in a previously coded and still buffered reference picture in the video, the block in the current picture can be coded by a vector that is referred to as a motion vector. The motion vector points to the reference block in the reference picture, and can have a third dimension identifying the reference picture, in case multiple reference pictures are in use.

In some embodiments, a bi-prediction technique can be used in the inter-picture prediction. According to the bi-prediction technique, two reference pictures, such as a first reference picture and a second reference picture that are both prior in decoding order to the current picture in the video (but may be in the past and future, respectively, in display order) are used. A block in the current picture can be coded by a first motion vector that points to a first reference block in the first reference picture, and a second motion vector that points to a second reference block in the second reference picture. The block can be predicted by a combination of the first reference block and the second reference block.

Further, a merge mode technique can be used in the inter-picture prediction to improve coding efficiency.

According to some embodiments of the disclosure, predictions, such as inter-picture predictions and intra-picture predictions are performed in the unit of blocks. For example, according to the HEVC standard, a picture in a sequence of video pictures is partitioned into coding tree units (CTU) for compression, the CTUs in a picture have the same size, such as 64×64 pixels, 32×32 pixels, or 16×16 pixels. In general, a CTU includes three coding tree blocks (CTBs), which are one luma CTB and two chroma CTBs. Each CTU can be recursively quadtree split into one or multiple coding units (CUs). For example, a CTU of 64×64 pixels can be split into one CU of 64×64 pixels, or 4 CUs of 32×32 pixels, or 16 CUs of 16×16 pixels. In an example, each CU is analyzed to determine a prediction type for the CU, such as an inter prediction type or an intra prediction type. The CU is split into one or more prediction units (PUs) depending on the temporal and/or spatial predictability. Generally, each PU includes a luma prediction block (PB), and two chroma PBs. In an embodiment, a prediction operation in coding (encoding/decoding) is performed in the unit of a prediction block. Using a luma prediction block as an example of a prediction block, the prediction block includes a matrix of values (e.g., luma values) for pixels, such as 8×8 pixels, 16×16 pixels, 8×16 pixels, 16×8 pixels, and the like.

FIG. 7 shows a diagram of a video encoder (703) according to another embodiment of the disclosure. The video encoder (703) is configured to receive a processing block (e.g., a prediction block) of sample values within a current video picture in a sequence of video pictures, and encode the processing block into a coded picture that is part of a coded video sequence. In an example, the video encoder (703) is used in the place of the video encoder (403) in the FIG. 4 example.

In an HEVC example, the video encoder (703) receives a matrix of sample values for a processing block, such as a prediction block of 8×8 samples, and the like. The video encoder (703) determines whether the processing block is best coded using intra mode, inter mode, or bi-prediction mode using, for example, rate-distortion optimization. When the processing block is to be coded in intra mode, the video encoder (703) may use an intra prediction technique to encode the processing block into the coded picture; and when the processing block is to be coded in inter mode or bi-prediction mode, the video encoder (703) may use an inter prediction or bi-prediction technique, respectively, to encode the processing block into the coded picture. In certain video coding technologies, merge mode can be an inter picture prediction submode where the motion vector is derived from one or more motion vector predictors without the benefit of a coded motion vector component outside the predictors. In certain other video coding technologies, a motion vector component applicable to the subject block may be present. In an example, the video encoder (703) includes other components, such as a mode decision module (not shown) to determine the mode of the processing blocks.

In the FIG. 7 example, the video encoder (703) includes the inter encoder (730), an intra encoder (722), a residue calculator (723), a switch (726), a residue encoder (724), a general controller (721), and an entropy encoder (725) coupled together as shown in FIG. 7.

The inter encoder (730) is configured to receive the samples of the current block (e.g., a processing block), compare the block to one or more reference blocks in reference pictures (e.g., blocks in previous pictures and later pictures), generate inter prediction information (e.g., description of redundant information according to inter encoding technique, motion vectors, merge mode information), and calculate inter prediction results (e.g., predicted block) based on the inter prediction information using any suitable technique. In some examples, the reference pictures are decoded reference pictures that are decoded based on the encoded video information.

The intra encoder (722) is configured to receive the samples of the current block (e.g., a processing block), in some cases compare the block to blocks already coded in the same picture, generate quantized coefficients after transform, and in some cases also intra prediction information (e.g., an intra prediction direction information according to one or more intra encoding techniques). In an example, the intra encoder (722) also calculates intra prediction results (e.g., predicted block) based on the intra prediction information and reference blocks in the same picture.

The general controller (721) is configured to determine general control data and control other components of the video encoder (703) based on the general control data. In an example, the general controller (721) determines the mode of the block, and provides a control signal to the switch (726) based on the mode. For example, when the mode is the intra mode, the general controller (721) controls the switch (726) to select the intra mode result for use by the residue calculator (723), and controls the entropy encoder (725) to select the intra prediction information and include the intra prediction information in the bitstream; and when the mode is the inter mode, the general controller (721) controls the switch (726) to select the inter prediction result for use by the residue calculator (723), and controls the entropy encoder (725) to select the inter prediction information and include the inter prediction information in the bitstream.

The residue calculator (723) is configured to calculate a difference (residue data) between the received block and prediction results selected from the intra encoder (722) or the inter encoder (730). The residue encoder (724) is configured to operate based on the residue data to encode the residue data to generate the transform coefficients. In an example, the residue encoder (724) is configured to convert the residue data from a spatial domain to a frequency domain, and generate the transform coefficients. The transform coefficients are then subject to quantization processing to obtain quantized transform coefficients. In various embodiments, the video encoder (703) also includes a residue decoder (728). The residue decoder (728) is configured to perform inverse-transform, and generate the decoded residue data. The decoded residue data can be suitably used by the intra encoder (722) and the inter encoder (730). For example, the inter encoder (730) can generate decoded blocks based on the decoded residue data and inter prediction information, and the intra encoder (722) can generate decoded blocks based on the decoded residue data and the intra prediction information. The decoded blocks are suitably processed to generate decoded pictures and the decoded pictures can be buffered in a memory circuit (not shown) and used as reference pictures in some examples.

The entropy encoder (725) is configured to format the bitstream to include the encoded block. The entropy encoder (725) is configured to include various information according to a suitable standard, such as the HEVC standard. In an example, the entropy encoder (725) is configured to include the general control data, the selected prediction information (e.g., intra prediction information or inter prediction information), the residue information, and other suitable information in the bitstream. Note that, according to the disclosed subject matter, when coding a block in the merge submode of either inter mode or bi-prediction mode, there is no residue information.

FIG. 8 shows a diagram of a video decoder (810) according to another embodiment of the disclosure. The video decoder (810) is configured to receive coded pictures that are part of a coded video sequence, and decode the coded pictures to generate reconstructed pictures. In an example, the video decoder (810) is used in the place of the video decoder (410) in the FIG. 4 example.

In the FIG. 8 example, the video decoder (810) includes an entropy decoder (871), an inter decoder (880), a residue decoder (873), a reconstruction module (874), and an intra decoder (872) coupled together as shown in FIG. 8.

The entropy decoder (871) can be configured to reconstruct, from the coded picture, certain symbols that represent the syntax elements of which the coded picture is made up. Such symbols can include, for example, the mode in which a block is coded (such as, for example, intra mode, inter mode, bi-predicted mode, the latter two in merge submode or another submode), prediction information (such as, for example, intra prediction information or inter prediction information) that can identify certain sample or metadata that is used for prediction by the intra decoder (872) or the inter decoder (880), respectively, residual information in the form of, for example, quantized transform coefficients, and the like. In an example, when the prediction mode is inter or bi-predicted mode, the inter prediction information is provided to the inter decoder (880); and when the prediction type is the intra prediction type, the intra prediction information is provided to the intra decoder (872). The residual information can be subject to inverse quantization and is provided to the residue decoder (873).

The inter decoder (880) is configured to receive the inter prediction information, and generate inter prediction results based on the inter prediction information.

The intra decoder (872) is configured to receive the intra prediction information, and generate prediction results based on the intra prediction information.

The residue decoder (873) is configured to perform inverse quantization to extract de-quantized transform coefficients, and process the de-quantized transform coefficients to convert the residual from the frequency domain to the spatial domain. The residue decoder (873) may also require certain control information (to include the Quantizer Parameter (QP)), and that information may be provided by the entropy decoder (871) (data path not depicted as this may be low volume control information only).

The reconstruction module (874) is configured to combine, in the spatial domain, the residual as output by the residue decoder (873) and the prediction results (as output by the inter or intra prediction modules as the case may be) to form a reconstructed block, that may be part of the reconstructed picture, which in turn may be part of the reconstructed video. It is noted that other suitable operations, such as a deblocking operation and the like, can be performed to improve the visual quality.

It is noted that the video encoders (403), (603), and (703), and the video decoders (410), (510), and (810) can be implemented using any suitable technique. In an embodiment, the video encoders (403), (603), and (703), and the video decoders (410), (510), and (810) can be implemented using one or more integrated circuits. In another embodiment, the video encoders (403), (603), and (603), and the video decoders (410), (510), and (810) can be implemented using one or more processors that execute software instructions.

Aspects of the disclosure provide techniques for error resiliency using picture segmentation. More specifically, several video coding technologies are provided for error resiliency in video transmission, in the context of error prone and/or bandwidth limit channels.

A video bitstream includes imaging data of a sequence of pictures. The pictures can be coded using different coding techniques. For example, a picture to be coded first (also referred to as a first picture) in a video bitstream is typically coded using intra prediction, and is referred to as an I picture (intra-coded picture). Then, subsequent pictures to the first picture can be coded using inter prediction techniques, thus the subsequent pictures are dependent on one or more previously coded pictures, and are referred to as inter coded pictures. Further, an inter coded picture can be categorized as a P picture (predicted picture) or a B picture (bidirectional predicted picture). The I picture is coded independently and can serve as reference picture for subsequent P or B pictures.

Generally, multiple I pictures are distributed in the sequence of pictures of a video bitstream. The multiple I pictures can prevent error propagations and provide random access functionality. For example, when pictures decoded before a specific I picture have errors, such as coding errors or video transmission errors, because the specific I picture is coded (encoded/decoded) independent of the pictures that are coded before the specific I picture, the errors in the pictures before the specific I picture will not cause errors in the decoding of the specific I picture. Further, the subsequent pictures of the specific I picture are coded based on the specific I picture, thus the errors in the pictures decoded before the specific I picture do not propagate to the subsequent pictures decoded after the specific I picture.

Further, when multiple I pictures are distributed in the sequence of pictures of the video bitstream, the video bitstream can be accessed not only from the beginning (e.g., the first I picture) of the video sequence, but also from other locations, such as other I pictures in the video bitstream. In some examples, the I pictures are referred to as key pictures.

In some embodiments, for the purpose of random access or error resilience, in a sequence of pictures of a video bitstream, key pictures can be periodically inserted between inter coded pictures. In an embodiment, the key pictures are I pictures. In an example, a video bitstream structure is: I-P-P-P-P-P-P-P-I-P-P-P-P-P-P-P . . . where I refers to an I picture and P refers to a P picture. In another example, a video bitstream structure is: I-B-B-P-B-B-P-B-B-I-B-B-P-B-B-P-B-B- . . . where I refers to an I picture, P refers to a P picture and B refers to a B picture.

According to an aspect of the disclosure, the amount of imaging data for an intra coded picture is much larger than the amount of imaging data for an inter coded picture, thus coding efficiency of inter coded pictures with motion compensation is higher than coding efficiency of an intra coded picture. Therefore, bandwidth required to transmit an inter coded picture can be significantly less than bandwidth required to transmit an intra coded picture. For example, in a coded video bitstream with an I-P-P-P structure or an I-B-B-P structure, the intra coded picture(s) or key picture(s) can use much more bandwidth than other pictures such as the P or B pictures.

It is noted that transmission errors may happen for video transmission. The transmission errors may cause picture loss or errors in the decoded pictures. In order to recover the transmission errors for a decoded video, retransmission, such as sending duplications of the video bitstream or duplications of portions of the video bistream can be used. For example, when two copies of a coded picture are sent, in case that one of the two copies is received successfully, the decoder will be able to decode the content, such as the picture, correctly.

Due to the importance of intra coded pictures, and the fact that sending all of coded pictures twice would be too much cost, in some examples, only intra coded pictures are sent twice. The technique of re-sending the intra coded pictures is referred to as intra picture double-sending (IPDS).

Considering the fact that the intra coded pictures require high bandwidth, the IPDS mechanism may cause significant end-to-end delay increase for video transmission. Sometimes, the required bandwidth for the video bitstream of an intra coded picture will exceed the capacity of the transmission channel. For example, the maximum allowed bandwidth for a channel is 1 Mb/s while an intra coded picture can consume or require a bandwidth of 2 Mb/s. In this case, to deliver 1 second of video content that is coded in intra prediction using the channel, 2 seconds of transmission over the channel are required. In the case of IPDS, delivery of 1 second of video content that is intra coded may take 4 seconds of transmission and retransmission over the channel. The lack of bandwidth will cause issues such as long end-to-end transmission delay and is considered as undesirable for efficient video delivery.

According to some aspect of the disclosure, a picture can be divided into segments, and the segments can be coded using different coding techniques.

FIGS. 9A and 9B show segmentation examples. FIG. 9A shows a segmentation example for slices. In the FIG. 9A example, a picture is divided into two slices (911) and (912). In some examples, a slice is defined as a number of consecutive basic processing units (e.g. macroblocks (MB), coding tree units (CTU), etc.) inside a picture. In the FIG. 9B example, a picture is divided into nine tiles (921)-(929). In some examples, a tile is defined as a rectangular region inside a picture.

Various embodiments of the disclosure provide methods and apparatuses to improve the video transmission efficiency in the context of error prone and bandwidth limited channel. The proposed methods may be used separately or combined in any order. In the following, the proposed methods may be standard aligned/encoder only methods or may require some changes to the existing video coding system/standards.

According to some aspects of the disclosure, a fraction of a key picture is re-transmitted for error resiliency and reduce bandwidth requirement. For example, some regions of a key picture that are more sensitive to overall quality assessment or considered as more important may be protected by resending only these regions. In an example, the coded regions at the center part of pictures are considered as more important to quality assessment. Then, key pictures are divided into segments (regions), such as with the use of tiles, slices, tile groups, etc. In some embodiments, the fraction of the key picture for re-sending corresponds to region of interest. In some embodiments, the fraction of the key picture for re-sending is intra coded portion of the key picture.

FIGS. 10A-10C show segmentation examples for a key picture.

FIG. 10A shows a segmentation example for a key picture (1010). The key picture (1010) is divided into (1011)-(1019) tiles of equal sizes. The center tile (1015) is region of interest (ROI) in an example, and is considered as more important to quality assessment.

FIG. 10B shows a segmentation example for a key picture (1020). In an example, the center portion, such as shown as (1025) is region of interest (ROI). Based on the ROI, the key picture (1020) is divided into (1021)-(1029) tiles.

FIG. 10C shows a segmentation example for a key picture (1030). The key picture (1030) is divided into (1031)-(1033) slices. The center slice (1032) is region of interest (ROI) and is considered as more important to quality assessment.

It is noted that FIGS. 10A-10C are merely segmentation examples, and the key pictures can be divided using other suitably segmentation techniques. In some examples, the key picture is portioned into segments, and the center one of the segments is used as an ROI. In some examples, the ROI is determined first, and then the key picture is partitioned into segments accordingly, and the ROI is one of the segments.

In some embodiments, when IPDS is required and the bandwidth cannot afford sending the whole key picture, then coded data of the ROI region or the most important region is considered to have higher priority, and is re-transmitted from the encoder side to the decoder side. Thus, when errors exist in the received data of the ROI region at the decoder side in response to a first transmission of the coded data for the key picture, the decoder can, according to received data in response to the re-transmission of the coded data of the ROI region, recover/refresh the possible loss/error in the more important part of the video (e.g., the ROI in the key picture, and the subsequent portions with reference to the ROI region in the key picture), which is considered to be more sensitive to the overall perceptual quality.

In some examples, the locations and size of the ROI region in the picture are known by both the encoder and the decoder. For example, the locations and size of the ROI region in the picture are predetermined, and then known by both the encoder and the decoder.

In some other examples, an importance attribute for a region (or a segment) can be signaled. For example, indicators of IPDS for regions are signaled. Specifically, in an example, for each coded region (e.g. slice), an indicator is signaled in the region header (e.g. slice header) for the indication of whether this region is considered as important or ROI.

In an embodiment, only regions in a key picture have this signaling flag in the header. In another embodiment, regardless of picture type or region type (e.g. slice type or tile group type), the header of each coded region has such an indicator to signal whether this region is important (e.g., ROI) or not.

In another embodiment, the ROI indicator is sent separate from the video bitstream. For example, the ROI indicator is sent via an SEI message. In the SEI message, the locations of the ROI can be described. Then, for each coded region in the bitstream, when a region is overlapped with the described ROI in SEI message, then the coded region is considered as an ROI region; otherwise, when a coded region does not have any overlap with the described ROI in SEI message, the coded region is considered as a non-ROI region.

In an example, the SEI message indicates that the ROI is the center region (1025) in FIG. 10B, and referred to as ROI 1025. When a key picture is divided into segments 1031-1033, such as slices, or tiles as shown in FIG. 10C. Then, the segments 1031 and 1033 do not overlap with the ROI 1025, and are considered as non-ROI regions. The segment 1032 overlaps with the ROI 1025, and is considered as an ROI region.

According to an aspect of the disclosure, the important regions, such as ROI regions are considered to have higher priority than the non-ROI regions, and image data of the ROI regions can be re-sent when necessary. In some examples, right after the image data of the key picture is sent for the first time, the image data of the ROI regions is re-sent. In some other examples, after the image data of the key picture is sent for the first time, and when errors are detected at, for example the decoder side, and then the encoder side is informed and the image data of the ROI region is re-sent from the encoder side to the decoder side.

In some embodiments, a technique that is referred to as intra segmentation over multiple pictures is used. Then imaging data retransmission is performed over multiple key pictures.

According to some aspects of the disclosure, segments in a picture can be respectively coded using different techniques, such as intra prediction technique, inter prediction technique and the like. An intra coded segment refers to a segment where samples in the segment may use information from coded part of the same segment for reference. Therefore, the intra coded segment can be reconstructed based on information of the intra coded segment. An intra coded segment can be a slice, a tile, a tile group, or the like, and thus, can also be referred to as an intra coded slice (also referred to as an I slice or an I slice), an intra coded tile (also referred to as an I tile), an intra coded tile group (also referred to as an I tile group), or the like. When an intra coded segment covers a picture, the picture may be referred to as an intra coded picture where samples in the picture may use information from the coded part of the same picture for reference. Therefore, the intra coded picture can be reconstructed based on information of the intra coded picture.

Further, according to an aspect of the disclosure, an inter coded segment refers to a segment where samples in the segment may use information from one or more previously coded segments (in the same picture or in previously coded pictures) in addition to the coded part of the same segment for reference. The inter coded segment can be a slice, a tile, a tile group, or the like. For example, an inter coded segment can be a P slice or a B slice. In another example, an inter coded segment can be a P tile or a B tile. An inter coded segment can be a P tile group (of multiple tiles) or a B tile group.

An inter coded segment can cover all or a portion of a picture according to different embodiments. When an inter coded segment that covers all portions of a picture, the picture is referred to as an inter coded picture where samples in the picture may use information from one or more previously coded pictures in addition to the coded part of the same picture for reference. The inter coded picture can be a P picture, a B picture, or the like.

To avoid bandwidth burst due to intra coded pictures and smooth bandwidth, in some embodiments, the technique that is referred to as intra segmentation over multiple pictures is used. Specifically, in some examples, each of the multiple pictures (e.g., consecutive pictures) has a segment that is coded using intra prediction, the other segments of the multiple pictures are coded using inter prediction. The segments that are intra coded in the multiple pictures are complementary, and can be joined into a picture. In some examples, the multiple pictures that respectively have the intra coded segments are referred to as key pictures.

In an embodiment, two key pictures are used, and each of key pictures is split into two segments (e.g., two slices, two tile groups, and the like), one of the two segments is intra coded and the other is inter coded. The two intra coded segments in the two key pictures are complementary. For example, the two areas of the two intra coded segments in the two key pictures are non-overlapping, and when the two area are joined, a new picture is formed. The inter coded segment can achieve higher coding efficiency as compared to using intra prediction only because samples in the inter coded slice can refer to not only information within the same inter coded slice but also to the previously coded I slice of the same picture. Therefore, a bandwidth requirement for transmitting each of the two key pictures can be reduced compared to a fully intra coded picture.

FIG. 11 shows an example of a video sequence (1101) according to an embodiment of the disclosure. The video sequence (1101) includes a sequence of pictures, such as picture 0 to picture 5. The sequence of pictures includes key pictures, such as picture 0 to picture 3 that each includes an intra coded segment.

In some embodiments, the video sequence (1101) is decoded from the picture 0 to the picture 5. The key pictures (picture 0 to picture 3) are consecutive pictures in the decoding order. In the FIG. 11 example, each of the key pictures (picture 0 to picture 3) is partitioned into four segments, such as four slices S0-S3. It is noted that while slices are used in the FIG. 11 example, the key pictures can be divided into tiles, tile groups, and the like.

Further, in the FIG. 11 example, each of the key pictures includes an intra coded segment, and the other segments are inter coded segments. For example, picture 0 includes an intra coded segment (1111) and inter coded segments (1121); picture 1 includes an intra coded segment (1112) and inter coded segments (1122) and (1123); picture 2 includes an intra coded segment (1113) and inter coded segments (1124) and (1125), and picture 3 includes an intra coded segment (1114) and inter coded segments (1126). It is noted that picture 4 and picture 5 are fully inter coded in the FIG. 11 example. The intra coded segments in FIG. 11 are shown by bright color and the inter coded segments are shown by grey color. The inter coded segments can be P slices or B slices.

Further, in the FIG. 11 example, the intra coded segments (1111)-(1114) are complementary. For example, each picture can be divided into four slices along vertical direction, and the four slices can be referred to top ¼ of the picture, upper middle ¼ of the picture, lower middle ¼ of the picture and bottom ¼ of the picture. Then, the intra coded segment 1111 is the top ¼ of picture 0, the intra coded segment 1112 is the upper middle ¼ of picture 1, the intra coded segment 1113 is the lower middle ¼ of picture 2, and the intra coded segment 1114 is the bottom ¼ of picture 3. The intra coded segments (1111)-(1114) are non-overlapping, and can be joined to cover an entire area of a picture.

According to an aspect of the disclosure, when intra segmentations over multiple key pictures are used, re-sending is performed on the intra coded regions in the multiple key pictures. Thus, by re-sending the intra coded regions in the multiple key pictures, peak bandwidth requirement can be reduced for the IPDS mechanism. In the FIG. 11 example, the bandwidth requirement of re-sending each of the four key pictures containing an intra coded region is lower than the bandwidth requirement of re-sending an entire picture that is intra coded.

In some examples, the intra coded regions in the corresponding pictures are considered as the ROI regions in the corresponding pictures. The ROI regions in the corresponding pictures are of higher importance than the non-ROI regions and have higher priority than the non-ROI regions, and are re-sent when necessary.

It is noted that the segmentation of intra coded regions can be implemented using any suitably technique. For example, the number of segments/key pictures can be different from the example in FIG. 11, and the way to segment the pictures can be different from the example in FIG. 11. In an example, each of four key pictures can be divided into four tiles in a quad-tree split style, one tile of each key pictures will be coded in intra prediction. The intra coded tile regions are complementary.

FIG. 12 shows an example of a video sequence (1201) according to an embodiment of the disclosure. Similarly to the example in FIG. 11, the video sequence (1201) includes a sequence of pictures, such as picture 0 to picture 5. The sequence of pictures includes key pictures, such as picture 0 to picture 3 that each includes an intra coded segment.

In some embodiments, the video sequence (1201) is decoded from the picture 0 to the picture 5. The key pictures (picture 0 to picture 3) are consecutive pictures in the decoding order. In the FIG. 12 example, each of the key pictures (picture 0 to picture 3) is divided into four tiles in a quad-tree split style, such as four tiles T0-T3.

Further, in the FIG. 12 example, each of the key pictures includes an intra coded segment, and the other segments are inter coded segments. For example, picture 0 includes an intra coded segment (1211) and inter coded segments (1221)-(1223); picture 1 includes an intra coded segment (1212) and inter coded segments (1224)-(1226); picture 2 includes an intra coded segment (1213) and inter coded segments (1227)-(1229), and picture 3 includes an intra coded segment (1214) and inter coded segments (1230)-(1232). It is noted that picture 4 and picture 5 are fully inter coded in the FIG. 12 example. The intra coded segments in FIG. 12 are shown by bright color and the inter coded segments are shown by grey color. The inter coded segments can be P slices or B slices.

Similarly to the example in FIG. 11, the intra coded regions are allocated across four consecutive key pictures, such as picture 0 to picture 3. In addition, the intra coded regions across picture 0 to picture 3 are complementary. For example, the intra coded regions across picture 0 to picture 3 are non-overlapping spatial locations, and the intra coded regions across picture 0 to picture 3 can be joined (disposed at their corresponding spatial locations) to cover an entire area of a picture. Thus, by re-sending the intra coded regions in the multiple key pictures, peak bandwidth requirement can be reduced for the IPDS mechanism.

Some aspects of the disclosure provide methods to assign reference pictures to inter coded regions in the key pictures. The methods include direct reference and indirect reference. When a previously coded region is signaled as a reference for a current region, and the current region refers directly to the previously coded region for prediction, then the previously coded region is a direct reference for the current region. For example, the previously coded region is the direct reference for the current region when the picture of the previously coded region is listed as a reference picture for the current region.

For the definition of indirect reference, a first coded region is signaled as a reference for prediction of a current region, the first coded region uses a second coded region as a reference directly or indirectly, then the second coded region is an indirect reference for the current region, even if the current region does not signal directly use of the second coded region as a reference.

In an embodiment, a video bitstream or a video sequence can include multiple random access intervals separated by random access boundaries. In an example, a random access interval of a random access boundary (also referred to as a random access point) starts from the random access boundary where video data in the random access interval can be independently decoded without knowing previously decoded data in one or more previous random access intervals. One or more intra coded regions within the random access interval can be a direct or an indirect reference for subsequent inter coded regions in the random access interval. Therefore, the inter coded regions in the random access interval can be decoded by referring to one or more regions in the same random access interval. In some examples, referring to an intra coded region of a previous random access interval directly or indirectly breaks the definition of random access boundary, and thus, video data in the random access interval may only refer to reference data directly or indirectly from the same random access interval.

In some embodiments that the intra coded regions are distributed in multiple key pictures, when the intra coded regions are re-transmitted for error resiliency, an error protection point (or boundary) is formed by gradual refresh of the intra coded regions across the key pictures.

FIG. 13 shows an example for an error protection point (or boundary) according to an embodiment of the disclosure. A video sequence (1300) includes a first set of pictures (1301) (also referred to as a first set (1301)) and a second set of pictures (1302) (also referred to as a second set (1302)). The first set (1301) includes pictures −2 to −1 that are belong to a previous random access interval of the video bitstream. The second set (1302) includes pictures 0 to 4 that belong to a new random access interval of the video bitstream. The second set (1302) includes multiple key pictures, i.e., the pictures 0 to 3. Each of the pictures 0 to 3 includes an intra coded region and one or more inter coded regions. The pictures 0 to 3 include the intra coded regions (1311)-(1314) and the inter coded regions (1321)-(1326). The picture 4 is an inter coded picture including one or more inter coded regions.

In FIG. 13, the video sequence (1300) is decoded in an order from the picture −2 to the picture 4. In some embodiments, the intra coded regions (1311)-(1314) are retransmitted for error protection. When the re-transmitted image data of the intra coded regions (1311)-(1314) are received, the retransmitted image data is used to refresh the decoded data to correct errors. Thus, the intra coded regions (1311)-(1314) form an error protection point (boundary) (1330) that spans across the multiple key pictures (i.e., the pictures 0 to 3). The error protection point (boundary) (1330) is shown as boundary sections (1331)-(1338).

When errors occur in the previous random access interval, such as in Picture −2, the errors can propagate to later coded pictures if the later coded pictures directly or indirectly use Picture −2 as a reference. According to some aspects of the disclosure, picture reference constraints are used to promote error protection by resending the intra coded region(s) in the key pictures.

In an embodiment, for a current inter coded region that is coded after the coding of the intra coded regions in the key pictures, when an intra coded region exists in the same position (also referred to as collocated) as the current inter coded region (for example, for the slice (1322) in Picture 1, an intra coded region (1311) of the same position in Picture 0 exists), the current inter coded region can refer to the intra coded regions directly or indirectly. In some examples, when a reference picture is assigned for an inter coded region (that is coded after the coding of the intra coded regions in the key pictures, and collocated intra coded region exists), for example the reference picture that includes the said collocated intra coded region is assigned to the inter coded region, the motion vector is constrained to only point to those intra coded regions. In another example, a picture that purely depends on the intra coded regions in the key pictures, can be used as a reference picture for the inter coded region that is coded after the coding of the intra coded regions in the key pictures. For example, for the slice (1322) of Picture 1 in FIG. 13, Picture 0 may be assigned as a reference picture for the slice (1322). However, for that slice (1322), only the intra coded region (1311) in Picture 0 can be used for inter prediction, and the motion vector is constrained to point into the intra coded region (1311). According to some aspects of the disclosure, the imaging data of the intra coded regions in the key pictures is re-transmitted to improve error resiliency. In this way, error propagation may be stopped from the error protection boundary of the key pictures.

In another embodiment, for an inter coded region that does not have a previously intra coded region of same location (collocated intra coded region) in the previous key pictures, the inter coded region can, however, refer to the reference pictures from previous random access interval (for example, the slice 1321 of Picture 0 can refer to Picture −1 as reference picture). The coding efficiency can be improved as compared to not using previous coded reference pictures.

Using the above constraints, an error protection point (boundary) is established, as indicated in the 1330 in FIG. 13. Previously occurred errors can be stopped on the right hand side of error protection point (boundary 1330).

In another approach, inter coded regions in all key pictures can only refer to reference pictures that are decoded after the first key picture (Picture 0 in FIG. 4) so all previous coded information before Picture 0 will not be used. Possible loss/error prior to Picture 0 can be stopped/refreshed.

FIG. 14 shows a flow chart outlining a process (1400) according to an embodiment of the disclosure. The process (1400) can be used in the reconstruction of a block coded in intra mode, so to generate a prediction block for the block under reconstruction. In various embodiments, the process (1400) are executed by processing circuitry, such as the processing circuitry in the terminal devices (310), (320), (330) and (340), the processing circuitry that performs functions of the video encoder (403), the processing circuitry that performs functions of the video decoder (410), the processing circuitry that performs functions of the video decoder (510), the processing circuitry that performs functions of the video encoder (603), and the like. In some embodiments, the process (1400) is implemented in software instructions, thus when the processing circuitry executes the software instructions, the processing circuitry performs the process (1400). The process starts at (S1401) and proceeds to (S1410).

At (S1410), first data of picture segments of a first picture in a video sequence is received, for example, from a video bitstream. The picture segments of the first picture include a first segment that is intra coded, and at least a second segment. The second segment is inter coded in an example. In another example, the second segment is intra coded. In an example, the first segment of the first picture is a center segment of the first picture. In another example, the first segment of the first picture overlaps with a region of interest (ROI). In some examples, the first segment corresponds to the ROI. The ROI can be predefined or can be signaled in the video bistream or in an SEI message.

At (S1420), second data of the first segment that is intra coded is received. The second data corresponds to a re-transmission of a subset of the picture segments of the first picture.

At (S1430), samples of the first segment of the first picture are reconstructed based on the second data when a decoding of the first segment of the first picture based on the first data fails. In some examples, the first data is decoded first to reconstruct the first picture. However, when errors are detected during the decoding of the first segment based on the first data, then the second data is decoded to reconstruct the first segment of the first picture. Then, the process proceeds to (S1499), and terminates.

In some embodiments, the first picture is one of multiple key pictures that each includes an intra coded segment, and the intra coded segments of the multiple key pictures are complementary. Then, for a current inter coded region that is coded after the coding of the intra coded regions in the key pictures, when an intra coded region exists in the same position (also referred to as collocated) as the current inter coded region, the current inter coded region can refer to the intra coded regions directly or indirectly. According to some aspects of the disclosure, the imaging data of the intra coded regions in the key pictures is re-transmitted to improve error resiliency. In this way, error propagation may be stopped from the key pictures.

The techniques described above, can be implemented as computer software using computer-readable instructions and physically stored in one or more computer-readable media. For example, FIG. 15 shows a computer system (1500) suitable for implementing certain embodiments of the disclosed subject matter.

The computer software can be coded using any suitable machine code or computer language, that may be subject to assembly, compilation, linking, or like mechanisms to create code comprising instructions that can be executed directly, or through interpretation, micro-code execution, and the like, by one or more computer central processing units (CPUs), Graphics Processing Units (GPUs), and the like.

The instructions can be executed on various types of computers or components thereof, including, for example, personal computers, tablet computers, servers, smartphones, gaming devices, internet of things devices, and the like.

The components shown in FIG. 15 for computer system (1500) are exemplary in nature and are not intended to suggest any limitation as to the scope of use or functionality of the computer software implementing embodiments of the present disclosure. Neither should the configuration of components be interpreted as having any dependency or requirement relating to any one or combination of components illustrated in the exemplary embodiment of a computer system (1500).

Computer system (1500) may include certain human interface input devices. Such a human interface input device may be responsive to input by one or more human users through, for example, tactile input (such as: keystrokes, swipes, data glove movements), audio input (such as: voice, clapping), visual input (such as: gestures), olfactory input (not depicted). The human interface devices can also be used to capture certain media not necessarily directly related to conscious input by a human, such as audio (such as: speech, music, ambient sound), images (such as: scanned images, photographic images obtain from a still image camera), video (such as two-dimensional video, three-dimensional video including stereoscopic video).

Input human interface devices may include one or more of (only one of each depicted): keyboard (1501), mouse (1502), trackpad (1503), touch screen (1510), data-glove (not shown), joystick (1505), microphone (1506), scanner (1507), camera (1508).

Computer system (1500) may also include certain human interface output devices. Such human interface output devices may be stimulating the senses of one or more human users through, for example, tactile output, sound, light, and smell/taste. Such human interface output devices may include tactile output devices (for example tactile feedback by the touch-screen (1510), data-glove (not shown), or joystick (1505), but there can also be tactile feedback devices that do not serve as input devices), audio output devices (such as: speakers (1509), headphones (not depicted)), visual output devices (such as screens (1510) to include CRT screens, LCD screens, plasma screens, OLED screens, each with or without touch-screen input capability, each with or without tactile feedback capability—some of which may be capable to output two dimensional visual output or more than three dimensional output through means such as stereographic output; virtual-reality glasses (not depicted), holographic displays and smoke tanks (not depicted)), and printers (not depicted).

Computer system (1500) can also include human accessible storage devices and their associated media such as optical media including CD/DVD ROM/RW (1520) with CD/DVD or the like media (1521), thumb-drive (1522), removable hard drive or solid state drive (1523), legacy magnetic media such as tape and floppy disc (not depicted), specialized ROM/ASIC/PLD based devices such as security dongles (not depicted), and the like.

Those skilled in the art should also understand that term “computer readable media” as used in connection with the presently disclosed subject matter does not encompass transmission media, carrier waves, or other transitory signals.

Computer system (1500) can also include an interface to one or more communication networks. Networks can for example be wireless, wireline, optical. Networks can further be local, wide-area, metropolitan, vehicular and industrial, real-time, delay-tolerant, and so on. Examples of networks include local area networks such as Ethernet, wireless LANs, cellular networks to include GSM, 3G, 4G, 5G, LTE and the like, TV wireline or wireless wide area digital networks to include cable TV, satellite TV, and terrestrial broadcast TV, vehicular and industrial to include CANBus, and so forth. Certain networks commonly require external network interface adapters that attached to certain general purpose data ports or peripheral buses (1549) (such as, for example USB ports of the computer system (1500)); others are commonly integrated into the core of the computer system (1500) by attachment to a system bus as described below (for example Ethernet interface into a PC computer system or cellular network interface into a smartphone computer system). Using any of these networks, computer system (1500) can communicate with other entities. Such communication can be uni-directional, receive only (for example, broadcast TV), uni-directional send-only (for example CANbus to certain CANbus devices), or bi-directional, for example to other computer systems using local or wide area digital networks. Certain protocols and protocol stacks can be used on each of those networks and network interfaces as described above.

Aforementioned human interface devices, human-accessible storage devices, and network interfaces can be attached to a core (1540) of the computer system (1500).

The core (1540) can include one or more Central Processing Units (CPU) (1541), Graphics Processing Units (GPU) (1542), specialized programmable processing units in the form of Field Programmable Gate Areas (FPGA) (1543), hardware accelerators for certain tasks (1544), and so forth. These devices, along with Read-only memory (ROM) (1545), Random-access memory (1546), internal mass storage such as internal non-user accessible hard drives, SSDs, and the like (1547), may be connected through a system bus (1548). In some computer systems, the system bus (1548) can be accessible in the form of one or more physical plugs to enable extensions by additional CPUs, GPU, and the like. The peripheral devices can be attached either directly to the core's system bus (1548), or through a peripheral bus (1549). Architectures for a peripheral bus include PCI, USB, and the like.

CPUs (1541), GPUs (1542), FPGAs (1543), and accelerators (1544) can execute certain instructions that, in combination, can make up the aforementioned computer code. That computer code can be stored in ROM (1545) or RAM (1546). Transitional data can be also be stored in RAM (1546), whereas permanent data can be stored for example, in the internal mass storage (1547). Fast storage and retrieve to any of the memory devices can be enabled through the use of cache memory, that can be closely associated with one or more CPU (1541), GPU (1542), mass storage (1547), ROM (1545), RAM (1546), and the like.

The computer readable media can have computer code thereon for performing various computer-implemented operations. The media and computer code can be those specially designed and constructed for the purposes of the present disclosure, or they can be of the kind well known and available to those having skill in the computer software arts.

As an example and not by way of limitation, the computer system having architecture (1500), and specifically the core (1540) can provide functionality as a result of processor(s) (including CPUs, GPUs, FPGA, accelerators, and the like) executing software embodied in one or more tangible, computer-readable media. Such computer-readable media can be media associated with user-accessible mass storage as introduced above, as well as certain storage of the core (1540) that are of non-transitory nature, such as core-internal mass storage (1547) or ROM (1545). The software implementing various embodiments of the present disclosure can be stored in such devices and executed by core (1540). A computer-readable medium can include one or more memory devices or chips, according to particular needs. The software can cause the core (1540) and specifically the processors therein (including CPU, GPU, FPGA, and the like) to execute particular processes or particular parts of particular processes described herein, including defining data structures stored in RAM (1546) and modifying such data structures according to the processes defined by the software. In addition or as an alternative, the computer system can provide functionality as a result of logic hardwired or otherwise embodied in a circuit (for example: accelerator (1544)), which can operate in place of or together with software to execute particular processes or particular parts of particular processes described herein. Reference to software can encompass logic, and vice versa, where appropriate. Reference to a computer-readable media can encompass a circuit (such as an integrated circuit (IC)) storing software for execution, a circuit embodying logic for execution, or both, where appropriate. The present disclosure encompasses any suitable combination of hardware and software.

APPENDIX A: ACRONYMS

-   JEM: joint exploration model -   VVC: versatile video coding -   BMS: benchmark set -   MV: Motion Vector -   HEVC: High Efficiency Video Coding -   SEI: Supplementary Enhancement Information -   VUI: Video Usability Information -   GOPs: Groups of Pictures -   TUs: Transform Units, -   PUs: Prediction Units -   CTUs: Coding Tree Units -   CTBs: Coding Tree Blocks -   PBs: Prediction Blocks -   HRD: Hypothetical Reference Decoder -   SNR: Signal Noise Ratio -   CPUs: Central Processing Units -   GPUs: Graphics Processing Units -   CRT: Cathode Ray Tube -   LCD: Liquid-Crystal Display -   OLED: Organic Light-Emitting Diode -   CD: Compact Disc -   DVD: Digital Video Disc -   ROM: Read-Only Memory -   RAM: Random Access Memory -   ASIC: Application-Specific Integrated Circuit -   PLD: Programmable Logic Device -   LAN: Local Area Network -   GSM: Global System for Mobile communications -   LTE: Long-Term Evolution -   CANBus: Controller Area Network Bus -   USB: Universal Serial Bus -   PCI: Peripheral Component Interconnect -   FPGA: Field Programmable Gate Areas -   SSD: solid-state drive -   IC: Integrated Circuit -   CU: Coding Unit

While this disclosure has described several exemplary embodiments, there are alterations, permutations, and various substitute equivalents, which fall within the scope of the disclosure. It will thus be appreciated that those skilled in the art will be able to devise numerous systems and methods which, although not explicitly shown or described herein, embody the principles of the disclosure and are thus within the spirit and scope thereof. 

What is claimed is:
 1. A method for video decoding in a decoder, comprising: receiving first data of picture segments of a first picture in a video sequence, the picture segments of the first picture including a first segment of the first picture that is intra coded, and at least a second segment; receiving second data of the first segment of the first picture that is intra coded, the second data corresponding to a re-transmission of a subset of the picture segments; and reconstructing samples of the first segment of the first picture based on the second data when a decoding of the first segment of the first picture based on the first data fails, wherein the first picture is one of multiple key pictures that each includes an intra coded segment, and the intra coded segments of the multiple key pictures are complementary non-overlapping segments that can be joined to cover an entire area of an intra coded picture (I picture), and the second data includes the first segment without including all of the remaining intra coded segments of the I picture.
 2. The method of claim 1, wherein the first segment of the first picture is a center segment of the first picture.
 3. The method of claim 1, wherein the first segment of the first picture overlaps with a region of interest (ROI).
 4. The method of claim 3, wherein the region of interest is predefined.
 5. The method of claim 3, further comprising: receiving, in a header for the first segment of the first picture, an indicator that indicates the first segment of the first picture being the region of interest.
 6. The method of claim 3, further comprising: receiving, in a supplemental enhancement information (SEI) message that is transmitted separately from the video sequence, an indicator that indicates the first segment being the region of interest.
 7. The method of claim 1, further comprising: receiving prediction information of a block in a second picture that is coded after the first picture, the block being located within a segment that is collocated with the first segment; and reconstructing the block with direct reference or indirect reference to the intra coded segments of the multiple key pictures.
 8. The method of claim 1, wherein the multiple key pictures are consecutive pictures.
 9. The method of claim 1, wherein the second segment of the first picture is inter coded.
 10. An apparatus for video decoding, comprising: processing circuitry configured to: receive first data of picture segments of a first picture in a video sequence, the picture segments of the first picture including a first segment of the first picture that is intra coded, and at least a second segment; receive second data of the first segment of the first picture that is intra coded, the second data corresponding to a re-transmission of a subset of the picture segments; and reconstruct samples of the first segment of the first picture based on the second data when a decoding of the first segment of the first picture based on the first data fails, wherein the first picture is one of multiple key pictures that each includes an intra coded segment, and the intra coded segments of the multiple key pictures are complementary non-overlapping segments that can be joined to cover an entire area of an intra coded picture (1 picture), and the second data includes the first segment without including all of the remaining intra coded segments of the I picture.
 11. The apparatus of claim 10, wherein the first segment of the first picture is a center segment of the first picture.
 12. The apparatus of claim 10, wherein the first segment of the first picture overlaps with a region of interest (ROI).
 13. The apparatus of claim 12, wherein the region of interest is predefined.
 14. The apparatus of claim 12, wherein the processing circuitry is configured to: receive, in a header for the first segment of the first picture, an indicator that indicates the first segment of the first picture being the region of interest.
 15. The apparatus of claim 12, wherein the processing circuitry is configured to: receive, in a supplemental enhancement information (SEI) message that is transmitted separately from the video sequence, an indicator that indicates the first segment being the region of interest.
 16. The apparatus of claim 10, wherein the processing circuitry is configured to: receive prediction information of a block in a second picture that is coded after the first picture, the block being located within a segment that is collocated with the first segment; and reconstruct the block with direct reference or indirect reference to the intra coded segments of the multiple key pictures.
 17. The apparatus of claim 10, wherein the multiple key pictures are consecutive pictures.
 18. A non-transitory computer-readable medium storing instructions which when executed by a computer for video decoding cause the computer to perform: receiving first data of picture segments of a first picture in a video sequence, the picture segments of the first picture including a first segment of the first picture that is intra coded, and at least a second segment; receiving second data of the first segment of the first picture that is intra coded, the second data corresponding to a re-transmission of a subset of the picture segments; and reconstructing samples of the first segment of the first picture based on the second data when a decoding of the first segment of the first picture based on the first data fails, wherein the first picture is one of multiple key pictures that each includes an intra coded segment, and the intra coded segments of the multiple key pictures are complementary non-overlapping segments that can be joined to cover an entire area of an intra coded picture (1 picture), and the second data includes the first segment without including all of the remaining intra coded segments of the I picture. 